RPCGB Method for Large-Scale Global Optimization Problems
نویسندگان
چکیده
In this paper, we propose a new approach for optimizing large-scale non-convex differentiable function subject to linear equality constraints. The proposed method, RPCGB (random perturbation of the conditional gradient method with bisection algorithm), computes search direction by gradient, and an optimal line is found algorithm, which results in decrease cost function. designed guarantee global convergence algorithm. An implementation testing are given, numerical problems that demonstrate its efficiency.
منابع مشابه
Gradient Method with Dynamical Retards for Large-scale Optimization Problems
We consider a generalization of the gradient method with retards for the solution of large-scale unconstrained optimization problems. Recently, the gradient method with retards was introduced to find global minimizers of large-scale quadratic functions. The most interesting feature of this method is that it does not involve a decrease in the objective function, which allows fast local convergen...
متن کاملA Curvilinear Method for Large Scale Optimization Problems
We present a new matrix-free method for the computation of the negative curvature direction in large scale unconstrained problems. We describe a curvilinear method which uses a combination of a quasi-Newton direction and a negative curvature direction. We propose an algorithm for the computation of the search directions which uses information of two specific L-BFGS matrices in such a way that a...
متن کاملA Large-Scale Stochastic-Perturbation Global Optimization Method for Molecular Cluster problems
We describe a new stochastic global optimization algorithm, and its application to a class of problems in molecular chemistry. The global optimization problem we consider is to find the lowest minimizer of a nonlinear function f that may contain multiple local minimizers, restricted to a bounded domain where f is assumed to be twice continuously differentiable. The two applications described in...
متن کاملMultilevel framework for large-scale global optimization
Large-scale global optimization (LSGO) algorithms are crucially important to handle real-world problems. Recently, cooperative co-evolution (CC) algorithms have successfully been applied for solving many large-scale practical problems. Many applications have imbalanced subcomponents where the size of subcomponents and their contribution to the objective function value are different. CC algorith...
متن کاملPath relinking for large-scale global optimization
In this paper we consider the problem of finding a global optimum of a multimodal function applying path relinking. In particular, we target unconstrained large scale problems and compare two variants of this methodology: the static and the evolutionary path relinking. Both are based on the strategy of creating trajectories of moves passing through high quality solutions in order to incorporate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2023
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms12060603